Euclidean algorithm - PDFSEARCH.IO - Document Search Engine

Euclidean algorithm
Results: 423

#	Item
71	ICS 164 – Winter 2007 – Midterm Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2014-04-25 02:18:01 Arrangement of lines Discrete geometry Doubly connected edge list Double-ended queue Line Sweep line algorithm Bentley–Ottmann algorithm Geometry Mathematics Euclidean plane geometry
72	Shattering a Set of Objects in 2D Subhas C. Nandy 3 Indian Statistical Institute, Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:03:42 Euclidean plane geometry Sweep line algorithm Dual polyhedron Simple polygon Randomized algorithm Planar separator theorem Geometry Discrete geometry Arrangement of lines
73	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Bipartite Matching under the RMS Distance Pankaj K. Agarwal∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:06 Analysis of algorithms Computational complexity theory Time complexity Ordinal number Matching Euclidean algorithm Symbol Theoretical computer science Applied mathematics Mathematics
74	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron∗ Kiat-Choong Chen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:33 Euclidean geometry Deltahedra Platonic solids Cybernetics Crossover Tetrahedron Mutation Octahedron Polyhedron Genetic algorithms Geometry Convex geometry
75	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon Mikkel Abrahamsen∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 22:08:03 Simple polygon Quadrilateral Polygons Euclidean plane geometry Visibility polygon
76	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
77	Algorithmica:1-10 Algorithmica 9 1990Springer-VerlagNew York Inc. An Improved Parallel Algorithm for Integer GCD Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2011-02-28 05:21:13 Computational complexity theory Greatest common divisor Euclidean algorithm Number theory Time complexity Factorial Binary GCD algorithm Computational complexity of mathematical operations Mathematics Theoretical computer science Multiplicative functions
78	CCCG 2010, Winnipeg MB, August 9–11, 2010 k-Star-shaped Polygons∗ William Evans† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-09-15 10:13:15 Euclidean plane geometry Polygons Analysis of algorithms Matching Vertex Randomized algorithm Connectivity Star polygon Simple polygon Theoretical computer science Geometry Mathematics
79	The EGMO 2015 Problem Committee thanks the following countries for submitting problem proposals: • Ireland • Japan • Luxembourg • Macedonia • Mexico Add to Reading List Source URL: www.egmo.org Language: English - Date: 2015-04-18 11:57:22 Greatest common divisor Coprime Algebraic number theory Modular arithmetic Combinatorics Euclidean algorithm Integer triangle Mathematics Number theory Multiplicative functions
80	Introduction to Walsh Analysis Alternative Views of the Genetic Algorithm R. Paul Wiegand Add to Reading List Source URL: cs.gmu.edu Language: English - Date: 2007-06-21 16:40:23 Abstract algebra Vectors Fourier analysis Unitary operators Vector space Basis Euclidean vector Vector Fourier transform Algebra Mathematics Linear algebra

UPDATE